Network Formation with Asymmetric Players and Chance Moves

نویسندگان

چکیده

We propose a model of network formation as two-stage game with chance moves and players various types. First, the leader suggests connected communication for to join. Second, nature selects type vector based on given probability distribution, each player decides whether or not join keeping in mind only his own leader’s type. The is incomplete information since has belief over payoff functions others. As result, formed, gets related both structure prove existence Bayesian equilibrium new definition stable partially defining be formed its existence. connection between Nash examined. Finally, we investigate characteristics structures under three-player major well n-player specific characteristic function.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Network formation with heterogeneous players

This paper extends the connections model of network formation by allowing for players who are heterogeneous with respect to values as well as the costs of forming links. Our principal result is that centrality and short average distances between individuals are robust features of equilibrium networks.  2005 Elsevier Inc. All rights reserved. JEL classification: C72

متن کامل

Network Formation Game with Different Cost Value for Players

In Social Networks, it is often interesting to study type of networks formed, its efficiency with respect to social objective and which networks are stable. Many work have already been there in this area. Players in network formation game will incur some cost to form a link. In previous work, all player will have same cost for forming a link int he network. Here we will the study the optimal ne...

متن کامل

Asymmetric Hat Game with three players and three colors

The Hat Game (Ebert’s Hat Problem) got much attention in the beginning of this century; not in the last place by its connections to coding theory and computer science. This paper studies Ebert’s hat problem with three persons and three colors, where the probabilities of the colors may be different (asymmetric case) . All players guess simultaneously the color of their own hat observing only the...

متن کامل

Coordination and Learning Behavior in Large Groups with Asymmetric Players

We study a class of large-group, noncooperative, iterated market entry games with complete information, binary choices, and asymmetric players in which the incentive of each player to enter the market decreases the larger the number of entrants. Experimental results from two different studies show remarkable coordination on the aggregate level, which is accounted for successfully by the Nash eq...

متن کامل

Network Games with Atomic Players

We study network games with atomic players that can split their flow. Some errors in the literature led to incorrect bounds on the price of anarchy of these games. We correct past results with a new bound for arbitrary sets of cost functions. In the case of affine cost functions, this bound implies that the price of anarchy is at most 3/2 and the cost of an equilibrium is not larger than that o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9080814